An Efficient and Simple Algorithm for Matrix Inversion
نویسندگان
چکیده
In this paper, a new algorithm is proposed for finding inverse and determinant of a given matrix in one instance. The algorithm is straightforward in understanding and manual calculations. Computer implementation of the algorithm is extremely simple and is quite efficient in time and memory utilization. The algorithm is supported by an example. The number of multiplication/division performed by the algorithm is exactlyn ; however, its efficiency lies in the simplicity of coding and minimal utilization of memory. Simple applicability and reduced execution time of the method is validated form the numerical experiments performed on test problems. The algorithm is applicable in the cases of pseudo inverses for nonsquare matrices and solution of system of linear equations with minor modification.
منابع مشابه
Calculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms
The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...
متن کاملA Simple, Artistic and Efficient Modification of the Inversion Method
The simplest and fastest way of producing an acceptable and accurate cast is by adopting the two-pour or inversion method. This process is slightly cumbersome and messy due to difficulty of access. A much more efficient, easy and artistic way of accomplishing it is described by adopting a Rotating Cake Icing Table with a Silicone Baking Mat on top as an autoclavable non-stick barrier.
متن کاملA stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کاملالگوریتم مستطیل آبشاری و ماتریس انتقال در شبکه های کوتاه ترین مسیر بادور
Shortest path problem is among the most interesting problems in the field of graph and network theory. There are many efficient matrix based algorithms for detecting of shortest path and distance between all pairs of this problem in literature. In this paper, a new exact algorithm, named Cascade Rectangle Algorithm, is presented by using main structure of previous exact algorithms and developin...
متن کاملApplication of Recursive Least Squares to Efficient Blunder Detection in Linear Models
In many geodetic applications a large number of observations are being measured to estimate the unknown parameters. The unbiasedness property of the estimated parameters is only ensured if there is no bias (e.g. systematic effect) or falsifying observations, which are also known as outliers. One of the most important steps towards obtaining a coherent analysis for the parameter estimation is th...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJTD
دوره 1 شماره
صفحات -
تاریخ انتشار 2010